Recurrence relations based on minimization
نویسندگان
چکیده
منابع مشابه
An asymptotic theory for recurrence relations based on minimization and maximization
We derive asymptotic approximations for the sequence f(n) de5ned recursively by f(n) = min16j¡n {f(j) + f(n− j)}+ g(n), when the asymptotic behavior of g(n) is known. Our tools are general enough and applicable to another sequence F(n) = max16j¡n {F(j) + F(n − j) + min{g(j); g(n− j)}}, also frequently encountered in divide-and-conquer problems. Applications of our results to algorithms, group t...
متن کاملRecurrence Relations for Quotient Moment of Generalized Pareto Distribution Based on Generalized Order Statistics and Characterization
Generalized Pareto distribution play an important role in reliability, extreme value theory, and other branches of applied probability and statistics. This family of distributions includes exponential distribution, Pareto distribution, and Power distribution. In this paper, we established exact expressions and recurrence relations satisfied by the quotient moments of generalized order statistic...
متن کاملRecurrence Relations for Moment Generating Functions of Generalized Order Statistics Based on Doubly Truncated Class of Distributions
In this paper, we derived recurrence relations for joint moment generating functions of nonadjacent generalized order statistics (GOS) of random samples drawn from doubly truncated class of continuous distributions. Recurrence relations for joint moments of nonadjacent GOS (ordinary order statistics (OOS) and k-upper records (k-RVs) as special cases) are obtained. Single and product moment gene...
متن کاملOn the dynamics of certain recurrence relations
In recent analyses [3, 4] the remarkable AGM continued fraction of Ramanujan—denoted R1(a, b)—was proven to converge for almost all complex parameter pairs (a, b). It was conjectured that R1 diverges if and only if (0 = a = be with cos2 φ = 1) or (a2 = b2 ∈ (−∞, 0)). In the present treatment we resolve this conjecture to the positive, thus establishing the precise convergence domain for R1. Thi...
متن کامل( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1974
ISSN: 0022-247X
DOI: 10.1016/0022-247x(74)90176-0